Minimax flow tree problems
نویسندگان
چکیده
منابع مشابه
Minimax flow tree problems
We examine a class of problems which seeks to find tree-structured networks which minimize the maximum cost among a subset of nodes in a graph. The cost metric is characterized by a series of parameters which can represent distance, flow volume, and delivery deadlines. Derived through variations in problem parameters, we present 17 different problems and discuss their worst-case complexity. Fou...
متن کاملA Note on Minimax Inverse Generalized Minimum Cost Flow Problems
Given a generalized network and a generalized feasible flow f, we consider a problem finding a modified edge cost d such that f is minimum cost with respect to d and the maximum deviation between the original edge cost and d is minimum. This paper shows the relationship between this problem and minimum mean circuit problems and analyze a binary search algorithm for this problem.
متن کاملNearly Optimal Minimax Tree Search?
Knuth and Moore presented a theoretical lower bound on the number of leaves that any fixed-depth minimax tree-search algorithm traversing a uniform tree must explore, the so-called minimal tree. Since real-life minimax trees aren’t uniform, the exact size of this tree isn’t known for most applications. Further, most games have transpositions, implying that there exists a minimal graph which is ...
متن کاملMinimax analysis of stochastic problems
In practical applications of stochastic programming the involved probability distributions are never known exactly. One can try to hedge against the worst expected value resulting from a considered set of permissible distributions. This leads to a min-max formulation of the corresponding stochastic programming problem. We show that, under mild regularity conditions, such a min-max problem gener...
متن کاملUniversity of Alberta Nearly Optimal Minimax Tree
Knuth and Moore presented a theoretical lower bound on the number of leaves that any fixed-depth minimax tree-search algorithm traversing a uniform tree must explore, the so-called minimal tree. Since real-life minimax trees aren’t uniform, the exact size of this tree isn’t known for most applications. Further, most games have transpositions, implying that there exists a minimal graph which is ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Networks
سال: 2009
ISSN: 0028-3045,1097-0037
DOI: 10.1002/net.20313